Amalgamations of factorizations of complete graphs
نویسنده
چکیده
Let t be a positive integer and let L = (l1, . . . , lt) and K = (k1, . . . , kt) be collections of nonnegative integers. A (t, K,L)-factorization of a graph is a decomposition of the graph into factors F1, . . . , Ft such that Fi is ki-regular and at least li-edge-connected. In this paper we apply the technique of amalgamations of graphs to study (t, K,L)factorizations of complete graphs. In particular, we describe precisely when it is possible to embed a factorization of Km in a (t, K,L)factorization of Kn. keywords: factorizations, embeddings, amalgamations
منابع مشابه
Amalgamations of factorizations of complete equipartite graphs
Let t be a positive integer, and let L = (l1, . . . , lt) and K = (k1, . . . , kt) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F1, . . . , Ft where, for 1 ≤ i ≤ t, Fi is ki-regular
متن کاملVarious One-Factorizations of Complete Graphs
Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...
متن کاملOn the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
In this paper we use orderly algorithms to enumerate (perfect) one-factorizations of complete graphs, the automorphism groups of which contain certain prescribed subgroups. We showed that, for the complete graph Ki2, excluding those one-factorizations containing exactly one automorphism of six disjoint cycles of length two, there are precisely 56391 nonisomorphic one-factorizations of Ki2 with ...
متن کاملNew infinite classes of 1-factorizations of complete graphs
Some classes of I-factorizations of complete graphs are known. They are GK2n , AK2n , W K 2n and their variations, and automorphism-free I-factorizations. In this paper, for any positive integer t, we construct new I-factorizations NtK 2n which are defined for all 2n with 2n ~ 6t. They also have some variations.
متن کاملPancomponented 2-factorizations of complete graphs
We pose and solve the existence of 2-factorizations of complete graphs and complete bipartite graphs that have the number of cycles per 2-factor varying, called pancomponented. Such 2-factorizations exist for all such graphs. The pancomponented problem requires a slight generalization of the methods used to solve pancyclic 2-factorization problem, by building 2-factors from cyclically generated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 97 شماره
صفحات -
تاریخ انتشار 2007